A polyhedral approach to bisubmodular function minimization

Abstract We consider minimization problems with bisubmodular objective functions. propose valid inequalities, namely the poly-bimatroid and provide a complete linear description of convex hull epigraph function. Furthermore, we develop cutting plane algorithm for constrained based on inequalities. Our computational experiments subproblem in robust coupled sensor placement show that our can solve highly non-linear do not admit compact mixed-integer formulations.